Leveled Adaptively Strong-Unforgeable Identity-Based Fully Homomorphic Signatures
نویسندگان
چکیده
منابع مشابه
(Leveled) Fully Homomorphic Signatures from Lattices
In a homomorphic signature scheme, given a vector of signatures ~σ corresponding to a dataset of messages ~ μ, there is a public algorithm that allows to derive a signature σ′ for message μ′ = f(~ μ) for any function f . Given the tuple (σ′, μ′, f) anyone can publicly verify the result of the computation of function f . Along with the standard notion of unforgeability for signatures, the securi...
متن کاملAdaptively Secure Fully Homomorphic Signatures Based on Lattices
In a homomorphic signature scheme, given the public key and a vector of signaturesσ := (σ1, . . . , σl) over l messages μ := (μ1, . . . , μl), there exists an efficient algorithm to produce a signature σ′ for μ = f(μ). Given the tuple (σ′, μ, f), anyone can then publicly verify the validity of the signature σ′. Inspired by the recent (selectively secure) key-homomorphic functional encryption fo...
متن کاملBootstrappable Identity-Based Fully Homomorphic Encryption
It has been an open problem for a number of years to construct an identity-based fully homomorphic encryption (IBFHE) scheme (first mentioned by Naccache at CHES/CRYPTO 2010). At CRYPTO 2013, Gentry, Sahai and Waters largely settled the problem by presenting leveled IBFHE constructions based on the Learning With Errors problem. However their constructions are not bootstrappable, and as a result...
متن کاملMulti-Key Homomorphic Signatures Unforgeable under Insider Corruption
Homomorphic signatures (HS) allows the derivation of the signature of the message-function pair (m, g), where m = g(m1, . . . ,mK), given the signatures of each of the input messages mk signed under the same key. Multi-key HS (M-HS) introduced by Fiore et al. (ASIACRYPT’16) further enhances the utility by allowing evaluation of signatures under different keys. While the unforgeability of existi...
متن کاملStrongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
We propose a variant of the “bonsai tree” signature scheme, a lattice-based existentially unforgeable signature scheme in the standard model. Our construction offers the same efficiency as the “bonsai tree” scheme but supports the stronger notion of strong unforgeability. Strong unforgeability demands that the adversary is unable to produce a new message-signature pair (m, s), even if he or she...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3003685